SAT 2009 competitive events booklet : preliminary version Organizers SAT competition : Daniel Le
نویسندگان
چکیده
GLUCOSE is based on a new scoring scheme for the clause learning mechanism, based on the paper [Audemard and Simon, 2009]. This short competition report summarizes the techniques embedded in the competition 09 version of GLUCOSE. Solver’s name comes from glue clauses, a particular kind of clauses that GLUCOSE detects and preserves during search. The web page for GLUCOSE is http://www.lri.fr/ ̃simon/glucose.
منابع مشابه
The International SAT Solver Competitions
is satisfiable is one of the most fundamental problems in computer science, known as the canonical NP-complete Boolean satisfiability (SAT) problem (Biere et al. 2009). In addition to its theoretical importance, major advances in the development of robust implementations of decision procedures for SAT, SAT solvers, have established SAT as an important declarative approach for attacking various ...
متن کاملThe SAT2002 Competition (preliminary draft)
SAT Competition 2002 held in March–May 2002 in conjunction with SAT 2002 (the Fifth International Symposium on the Theory and Applications of Satisfiability Testing). About 30 solvers and 2300 benchmarks took part in the competition, which required more than 2 CPU years to complete the evaluation. In this report, we give the results of the competition, try to interpret them, and give suggestion...
متن کاملCSP2SAT4J: A Simple CSP to SAT translator
SAT solvers can now handle very large SAT instances. As a consequence, many translations into SAT have been shown successful in recent years: Planning and Bounded Model Checking are two examples of applications in which SAT engines are reported to be as good as or even better than dedicated software. During the first CSP competition, SATbased approaches were demonstrated competitive with the ot...
متن کاملThe Essentials of the SAT 2003 Competition
The SAT 2003 Competition ran in February – May 2003, in conjunction with SAT’03 (the Sixth Fifth International Symposium on the Theory and Applications of Satisfiability Testing). One year after the SAT 2002 competition, it was not clear that significant progress could be made in the area in such a little time. The competition was a success – 34 solvers and 993 benchmarks, needing 522 CPU days ...
متن کاملThe Sat 4 j library , release 2 . 2 system description
Sat4j is a mature, open source library of SAT-based solvers in Java. It provides a modular SAT solver architecture designed to work with generic constraints. Such architecture is used to provide SAT, MaxSat and pseudo-boolean and solvers for lightweight constraint programming. Those solvers have been evaluated regularly in the corresponding international competitive events. The library has been...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009